Reducing Cognitive Overhead on the World Wide Web

نویسندگان

  • R. J. Witt
  • S. P. Tyerman
چکیده

HyperScout, a Web application, is an intermediary between a server and a client. It intercepts a page to the client, gathers information on each link, and annotates each link with the discovered information. This paper reports on the development of HyperScout var UniSA, a development of the HyperScout model and application, that dramatically extends static and dynamic link annotations. Annotations provide the user with additional information, which they use to make better navigational choices. On the web, it is common for long lists of hyperlinks to be presented to the user, from which they select links to follow or ignore. The user’s mental state in this situation is termed cognitive overhead, a potentially overwhelming condition. To assist the user in making their choice, various characteristics of a link may be presented to the user. Despite these characteristics being readily available from a number of sources, current web servers and browsers do not attempt to retrieve, let alone display, such attributes. To show that cognitive overhead is easily, and immediately, reducible, a number of techniques were explored. Development progressed from statically created annotations, through to dynamically generated annotations. The static annotations were implemented with a combination of tools available to every web author. It was found that, while simple enough for every author to implement, static annotations bearing static information would not be accurate or timely enough to guide the user. Therefore, information must be gathered dynamically. The solution is either an intermediary between server and client, or a more sophisticated browser.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Patterns of Revisitation in World Wide Web Navigation

In this paper, we report user's revisitation patterns to World Wide Web (WWW) pages, and use the results to lay an empirical foundation towards the design of history mechanisms in Web browsers. Through history, a user can return quickly to a previously visited page, ostensibly reducing the cognitive and physical overhead required to navigate to it from scratch. We analyzed 6 weeks of detailed u...

متن کامل

How people revisit web pages: empirical findings and implications for the design of history systems

We report on users’ revisitation patterns to World Wide Web (web) pages, and use the results to lay an empirical foundation for the design of history mechanisms in web browsers. Through history, a user can return quickly to a previously visited page, possibly reducing the cognitive and physical overhead required to navigate to it from scratch. We analysed 6 weeks of detailed usage data collecte...

متن کامل

A Computational Model and Classification Framework for Social

Social navigation is the process of making navigational decisions in real or virtual environments based on social and communicative interaction with others. A computational model for social navigation is presented as an extension to an existing framework for general navigation, reducing decision-making to the minimization of cognitive costs. Consideration for social navigation gives rise to a c...

متن کامل

Potential and Limits of Web Prefetching Between Low-Bandwidth Clients and Proxies

The majority of the Internet population access the World Wide Web via dial-up modem connections. Studies have shown that limited modem bandwidth is the main contributing factor to the Web access la-tency perceived by the users. In this paper, we investigate one approach to reduce the user-perceived latency: pre-pushing from the proxy to the browsers. The approach takes advantage of the idle tim...

متن کامل

Web-Site-Based Partitioning Techniques for Reducing the Preprocessing Overhead before the Parallel PageRank Computations

The efficiency of the PageRank computation is important since the constantly evolving nature of the Web requires this computation to be repeated many times. Due to the enormous size of the Web’s hyperlink structure, PageRank computations are usually carried out on parallel computers. Recently, a hypergraph-partitioning-based formulation for parallel sparse-matrix vector multiplication is propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002